Infinite-state high-level MSCs: Model-checking and realizability
نویسندگان
چکیده
منابع مشابه
Infinite-State High-Level MSCs: Model-Checking and Realizability
We consider three natural classes of infinite-state HMSCs: globally-cooperative, locally-cooperative and local-choice HMSCs. We show first that model-checking for globally-cooperative and locally-cooperative HMSCs is of the same complexity as for the class of finite state HMSCs. Surprisingly, model-checking local-choice HMSCs turns out to be exponentially more efficient in space than for locall...
متن کاملGlobal Model-Checking of Infinite-State Systems
We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Chec...
متن کاملImage Computation in Infinite State Model Checking
The model checking of a counters system S often reduces to the effective computation of the set of predecessors Pre∗S(X) of a set of integer vectors X. Because the exact computation of this set is not possible in general, we are interested in characterizing the minimal Number Decision Diagrams (NDD) [WB00] that represents the set Pre(X). In particular, its size is proved to be just polynomially...
متن کاملOn Model Checking Infinite-State Systems
This paper presents a proof method for proving that innnite-state systems satisfy properties expressed in the modal-calculus. The method is sound and complete relative to externally proving inclusions of sets of states. It can be seen as a recast of a tableau method due to Braddeld and Stirling following lines used by Winskel for nite-state systems. Contrary to the tableau method, it avoids the...
متن کاملSelfless Interpolation for Infinite-State Model Checking
We present a new method for interpolation in satisfiability modulo theories (SMT) that is aimed at applications in model-checking and invariant inference. The new method allows us to control the finiteconvergence of interpolant sequences and, at the same time, provides expressive invariant-driven interpolants. It is based on a novel integration of model-driven quantifier elimination and abstrac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2006
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2005.09.007